t = int(input())
for _ in range(t):
n = int(input())
a = [int(i) for i in input().strip().split()]
b = [int(i) for i in input().strip().split()]
ra = 0
rb = 0
add = 0
sub = 0
for i in range(n):
if a[i]>b[i]: ra += a[i]
elif b[i]>a[i]: rb += b[i]
elif a[i]>0: add += a[i]
elif a[i]<0: sub -= a[i]
for i in range(add):
if ra<rb: ra += 1
else: rb += 1
for i in range(sub):
if ra<rb: rb -= 1
else: ra -= 1
print(min(ra,rb))
580A- Kefa and First Steps | 1472B- Fair Division |
996A - Hit the Lottery | MSNSADM1 Football |
MATCHES Playing with Matches | HRDSEQ Hard Sequence |
DRCHEF Doctor Chef | 559. Maximum Depth of N-ary Tree |
821. Shortest Distance to a Character | 1441. Build an Array With Stack Operations |
1356. Sort Integers by The Number of 1 Bits | 922. Sort Array By Parity II |
344. Reverse String | 1047. Remove All Adjacent Duplicates In String |
977. Squares of a Sorted Array | 852. Peak Index in a Mountain Array |
461. Hamming Distance | 1748. Sum of Unique Elements |
897. Increasing Order Search Tree | 905. Sort Array By Parity |
1351. Count Negative Numbers in a Sorted Matrix | 617. Merge Two Binary Trees |
1450. Number of Students Doing Homework at a Given Time | 700. Search in a Binary Search Tree |
590. N-ary Tree Postorder Traversal | 589. N-ary Tree Preorder Traversal |
1299. Replace Elements with Greatest Element on Right Side | 1768. Merge Strings Alternately |
561. Array Partition I | 1374. Generate a String With Characters That Have Odd Counts |